Compiling Semiring-Based Constraints with clp (FD, S)
نویسندگان
چکیده
In some recent works, a general framework for nite domains constraint satisfaction has been deened, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions , to compute arc-consistency. Restricting to that case and integrating semiring-based constraint solving in the Constraint Logic Programming paradigm, we have implemented a generic language, clp(FD,S), for semiring-based constraint satisfaction. In this paper, we describe the kernel of the language: the SFD system and our implementation of clp(FD,S). We also give some performance results on various examples.
منابع مشابه
Encoding global constraints in semiring-based constraint solving
In recent works, a general framework for constraint satisfaction over nite domains has been proposed, based on the concept of semiring-valued constraints. Classical CSPs, fuzzy CSPs, hierachical CSPs can be easily cast in this general framework. In this paper, we claim that translating any constraint problem into a semiring-based constraint problem makes it possible to express global in-formati...
متن کاملCompiling Constraints in clp(FD)
We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation mechanism. Complex user constraints such as l...
متن کاملAHigh - Level Intermediate Language and the Algorithms for Compiling Finite - Domain Constraints 1
In this paper, we present a high-level intermediate language, called delay-Prolog, for implementing CLP(FD), the constraint language over nite-domains. Delay-Prolog has a much stronger description power than indexical, the intermediate language widely used in current nite-domain constraint compilers. It is powerful enough for describing all kinds of constraint propagation procedures, which by n...
متن کاملWAMCC: Compiling Prolog to C
We present the wamcc system, a Prolog compiler that translates Prolog to C via the WAM. This approach has some interesting consequences: simplicity, efficiency, portability, extensibility and modularity. Indeed the system does not incorporate complex optimizations but is as efficient as Quintus Prolog 2.5 (based on an emulator written in assembly language) and only 30 % slower than Sicstus Prol...
متن کامل